H-Termination proof of /home/matraf/haskell/eval_FullyBlown

YES 2.257 H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/empty.hs
H-Termination of the given Haskell-Program with start terms could successfully be proven:

↳ HASKELL

  ↳ IFR

mainModule Main

((mod :: Int -> Int -> Int) :: Int -> Int -> Int)

module Main where

import qualified Prelude

If Reductions:
The following If expression

if primGEqNatS x y then primModNatS (primMinusNatS x y) (Succ y) else Succ x

is transformed to

primModNatS0 x y True = primModNatS (primMinusNatS x y) (Succ y)

primModNatS0 x y False = Succ x

The following If expression

if primGEqNatS x y then primModNatP (primMinusNatS x y) (Succ y) else primMinusNatS y x

is transformed to

primModNatP0 x y True = primModNatP (primMinusNatS x y) (Succ y)

primModNatP0 x y False = primMinusNatS y x

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

mainModule Main

((mod :: Int -> Int -> Int) :: Int -> Int -> Int)

module Main where

import qualified Prelude

Replaced joker patterns by fresh variables and removed binding patterns.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

mainModule Main

((mod :: Int -> Int -> Int) :: Int -> Int -> Int)

module Main where

import qualified Prelude

Cond Reductions:
The following Function with conditions

undefined

| False

= undefined

is transformed to

undefined = undefined1

undefined0 True = undefined

undefined1 = undefined0 False

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

mainModule Main

(mod :: Int -> Int -> Int)

module Main where

import qualified Prelude

Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="mod",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="mod vz3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
4[label="mod vz3 vz4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3];
5[label="primModInt vz3 vz4",fontsize=16,color="burlywood",shape="box"];679[label="vz3/Pos vz30",fontsize=10,color="white",style="solid",shape="box"];5 -> 679[label="",style="solid", color="burlywood", weight=9];
679 -> 6[label="",style="solid", color="burlywood", weight=3];
680[label="vz3/Neg vz30",fontsize=10,color="white",style="solid",shape="box"];5 -> 680[label="",style="solid", color="burlywood", weight=9];
680 -> 7[label="",style="solid", color="burlywood", weight=3];
6[label="primModInt (Pos vz30) vz4",fontsize=16,color="burlywood",shape="box"];681[label="vz4/Pos vz40",fontsize=10,color="white",style="solid",shape="box"];6 -> 681[label="",style="solid", color="burlywood", weight=9];
681 -> 8[label="",style="solid", color="burlywood", weight=3];
682[label="vz4/Neg vz40",fontsize=10,color="white",style="solid",shape="box"];6 -> 682[label="",style="solid", color="burlywood", weight=9];
682 -> 9[label="",style="solid", color="burlywood", weight=3];
7[label="primModInt (Neg vz30) vz4",fontsize=16,color="burlywood",shape="box"];683[label="vz4/Pos vz40",fontsize=10,color="white",style="solid",shape="box"];7 -> 683[label="",style="solid", color="burlywood", weight=9];
683 -> 10[label="",style="solid", color="burlywood", weight=3];
684[label="vz4/Neg vz40",fontsize=10,color="white",style="solid",shape="box"];7 -> 684[label="",style="solid", color="burlywood", weight=9];
684 -> 11[label="",style="solid", color="burlywood", weight=3];
8[label="primModInt (Pos vz30) (Pos vz40)",fontsize=16,color="burlywood",shape="box"];685[label="vz40/Succ vz400",fontsize=10,color="white",style="solid",shape="box"];8 -> 685[label="",style="solid", color="burlywood", weight=9];
685 -> 12[label="",style="solid", color="burlywood", weight=3];
686[label="vz40/Zero",fontsize=10,color="white",style="solid",shape="box"];8 -> 686[label="",style="solid", color="burlywood", weight=9];
686 -> 13[label="",style="solid", color="burlywood", weight=3];
9[label="primModInt (Pos vz30) (Neg vz40)",fontsize=16,color="burlywood",shape="box"];687[label="vz40/Succ vz400",fontsize=10,color="white",style="solid",shape="box"];9 -> 687[label="",style="solid", color="burlywood", weight=9];
687 -> 14[label="",style="solid", color="burlywood", weight=3];
688[label="vz40/Zero",fontsize=10,color="white",style="solid",shape="box"];9 -> 688[label="",style="solid", color="burlywood", weight=9];
688 -> 15[label="",style="solid", color="burlywood", weight=3];
10[label="primModInt (Neg vz30) (Pos vz40)",fontsize=16,color="burlywood",shape="box"];689[label="vz40/Succ vz400",fontsize=10,color="white",style="solid",shape="box"];10 -> 689[label="",style="solid", color="burlywood", weight=9];
689 -> 16[label="",style="solid", color="burlywood", weight=3];
690[label="vz40/Zero",fontsize=10,color="white",style="solid",shape="box"];10 -> 690[label="",style="solid", color="burlywood", weight=9];
690 -> 17[label="",style="solid", color="burlywood", weight=3];
11[label="primModInt (Neg vz30) (Neg vz40)",fontsize=16,color="burlywood",shape="box"];691[label="vz40/Succ vz400",fontsize=10,color="white",style="solid",shape="box"];11 -> 691[label="",style="solid", color="burlywood", weight=9];
691 -> 18[label="",style="solid", color="burlywood", weight=3];
692[label="vz40/Zero",fontsize=10,color="white",style="solid",shape="box"];11 -> 692[label="",style="solid", color="burlywood", weight=9];
692 -> 19[label="",style="solid", color="burlywood", weight=3];
12[label="primModInt (Pos vz30) (Pos (Succ vz400))",fontsize=16,color="black",shape="box"];12 -> 20[label="",style="solid", color="black", weight=3];
13[label="primModInt (Pos vz30) (Pos Zero)",fontsize=16,color="black",shape="box"];13 -> 21[label="",style="solid", color="black", weight=3];
14[label="primModInt (Pos vz30) (Neg (Succ vz400))",fontsize=16,color="black",shape="box"];14 -> 22[label="",style="solid", color="black", weight=3];
15[label="primModInt (Pos vz30) (Neg Zero)",fontsize=16,color="black",shape="box"];15 -> 23[label="",style="solid", color="black", weight=3];
16[label="primModInt (Neg vz30) (Pos (Succ vz400))",fontsize=16,color="black",shape="box"];16 -> 24[label="",style="solid", color="black", weight=3];
17[label="primModInt (Neg vz30) (Pos Zero)",fontsize=16,color="black",shape="box"];17 -> 25[label="",style="solid", color="black", weight=3];
18[label="primModInt (Neg vz30) (Neg (Succ vz400))",fontsize=16,color="black",shape="box"];18 -> 26[label="",style="solid", color="black", weight=3];
19[label="primModInt (Neg vz30) (Neg Zero)",fontsize=16,color="black",shape="box"];19 -> 27[label="",style="solid", color="black", weight=3];
20[label="Pos (primModNatS vz30 (Succ vz400))",fontsize=16,color="green",shape="box"];20 -> 28[label="",style="dashed", color="green", weight=3];
21[label="error []",fontsize=16,color="black",shape="triangle"];21 -> 29[label="",style="solid", color="black", weight=3];
22[label="Neg (primModNatP vz30 (Succ vz400))",fontsize=16,color="green",shape="box"];22 -> 30[label="",style="dashed", color="green", weight=3];
23 -> 21[label="",style="dashed", color="red", weight=0];
23[label="error []",fontsize=16,color="magenta"];24[label="Pos (primModNatP vz30 (Succ vz400))",fontsize=16,color="green",shape="box"];24 -> 31[label="",style="dashed", color="green", weight=3];
25 -> 21[label="",style="dashed", color="red", weight=0];
25[label="error []",fontsize=16,color="magenta"];26[label="Neg (primModNatS vz30 (Succ vz400))",fontsize=16,color="green",shape="box"];26 -> 32[label="",style="dashed", color="green", weight=3];
27 -> 21[label="",style="dashed", color="red", weight=0];
27[label="error []",fontsize=16,color="magenta"];28[label="primModNatS vz30 (Succ vz400)",fontsize=16,color="burlywood",shape="triangle"];696[label="vz30/Succ vz300",fontsize=10,color="white",style="solid",shape="box"];28 -> 696[label="",style="solid", color="burlywood", weight=9];
696 -> 33[label="",style="solid", color="burlywood", weight=3];
697[label="vz30/Zero",fontsize=10,color="white",style="solid",shape="box"];28 -> 697[label="",style="solid", color="burlywood", weight=9];
697 -> 34[label="",style="solid", color="burlywood", weight=3];
29[label="error []",fontsize=16,color="red",shape="box"];30[label="primModNatP vz30 (Succ vz400)",fontsize=16,color="burlywood",shape="triangle"];698[label="vz30/Succ vz300",fontsize=10,color="white",style="solid",shape="box"];30 -> 698[label="",style="solid", color="burlywood", weight=9];
698 -> 35[label="",style="solid", color="burlywood", weight=3];
699[label="vz30/Zero",fontsize=10,color="white",style="solid",shape="box"];30 -> 699[label="",style="solid", color="burlywood", weight=9];
699 -> 36[label="",style="solid", color="burlywood", weight=3];
31 -> 30[label="",style="dashed", color="red", weight=0];
31[label="primModNatP vz30 (Succ vz400)",fontsize=16,color="magenta"];31 -> 37[label="",style="dashed", color="magenta", weight=3];
31 -> 38[label="",style="dashed", color="magenta", weight=3];
32 -> 28[label="",style="dashed", color="red", weight=0];
32[label="primModNatS vz30 (Succ vz400)",fontsize=16,color="magenta"];32 -> 39[label="",style="dashed", color="magenta", weight=3];
32 -> 40[label="",style="dashed", color="magenta", weight=3];
33[label="primModNatS (Succ vz300) (Succ vz400)",fontsize=16,color="black",shape="box"];33 -> 41[label="",style="solid", color="black", weight=3];
34[label="primModNatS Zero (Succ vz400)",fontsize=16,color="black",shape="box"];34 -> 42[label="",style="solid", color="black", weight=3];
35[label="primModNatP (Succ vz300) (Succ vz400)",fontsize=16,color="black",shape="box"];35 -> 43[label="",style="solid", color="black", weight=3];
36[label="primModNatP Zero (Succ vz400)",fontsize=16,color="black",shape="box"];36 -> 44[label="",style="solid", color="black", weight=3];
37[label="vz30",fontsize=16,color="green",shape="box"];38[label="vz400",fontsize=16,color="green",shape="box"];39[label="vz30",fontsize=16,color="green",shape="box"];40[label="vz400",fontsize=16,color="green",shape="box"];41[label="primModNatS0 vz300 vz400 (primGEqNatS vz300 vz400)",fontsize=16,color="burlywood",shape="box"];702[label="vz300/Succ vz3000",fontsize=10,color="white",style="solid",shape="box"];41 -> 702[label="",style="solid", color="burlywood", weight=9];
702 -> 45[label="",style="solid", color="burlywood", weight=3];
703[label="vz300/Zero",fontsize=10,color="white",style="solid",shape="box"];41 -> 703[label="",style="solid", color="burlywood", weight=9];
703 -> 46[label="",style="solid", color="burlywood", weight=3];
42[label="Zero",fontsize=16,color="green",shape="box"];43[label="primModNatP0 vz300 vz400 (primGEqNatS vz300 vz400)",fontsize=16,color="burlywood",shape="box"];704[label="vz300/Succ vz3000",fontsize=10,color="white",style="solid",shape="box"];43 -> 704[label="",style="solid", color="burlywood", weight=9];
704 -> 47[label="",style="solid", color="burlywood", weight=3];
705[label="vz300/Zero",fontsize=10,color="white",style="solid",shape="box"];43 -> 705[label="",style="solid", color="burlywood", weight=9];
705 -> 48[label="",style="solid", color="burlywood", weight=3];
44[label="Zero",fontsize=16,color="green",shape="box"];45[label="primModNatS0 (Succ vz3000) vz400 (primGEqNatS (Succ vz3000) vz400)",fontsize=16,color="burlywood",shape="box"];706[label="vz400/Succ vz4000",fontsize=10,color="white",style="solid",shape="box"];45 -> 706[label="",style="solid", color="burlywood", weight=9];
706 -> 49[label="",style="solid", color="burlywood", weight=3];
707[label="vz400/Zero",fontsize=10,color="white",style="solid",shape="box"];45 -> 707[label="",style="solid", color="burlywood", weight=9];
707 -> 50[label="",style="solid", color="burlywood", weight=3];
46[label="primModNatS0 Zero vz400 (primGEqNatS Zero vz400)",fontsize=16,color="burlywood",shape="box"];708[label="vz400/Succ vz4000",fontsize=10,color="white",style="solid",shape="box"];46 -> 708[label="",style="solid", color="burlywood", weight=9];
708 -> 51[label="",style="solid", color="burlywood", weight=3];
709[label="vz400/Zero",fontsize=10,color="white",style="solid",shape="box"];46 -> 709[label="",style="solid", color="burlywood", weight=9];
709 -> 52[label="",style="solid", color="burlywood", weight=3];
47[label="primModNatP0 (Succ vz3000) vz400 (primGEqNatS (Succ vz3000) vz400)",fontsize=16,color="burlywood",shape="box"];710[label="vz400/Succ vz4000",fontsize=10,color="white",style="solid",shape="box"];47 -> 710[label="",style="solid", color="burlywood", weight=9];
710 -> 53[label="",style="solid", color="burlywood", weight=3];
711[label="vz400/Zero",fontsize=10,color="white",style="solid",shape="box"];47 -> 711[label="",style="solid", color="burlywood", weight=9];
711 -> 54[label="",style="solid", color="burlywood", weight=3];
48[label="primModNatP0 Zero vz400 (primGEqNatS Zero vz400)",fontsize=16,color="burlywood",shape="box"];712[label="vz400/Succ vz4000",fontsize=10,color="white",style="solid",shape="box"];48 -> 712[label="",style="solid", color="burlywood", weight=9];
712 -> 55[label="",style="solid", color="burlywood", weight=3];
713[label="vz400/Zero",fontsize=10,color="white",style="solid",shape="box"];48 -> 713[label="",style="solid", color="burlywood", weight=9];
713 -> 56[label="",style="solid", color="burlywood", weight=3];
49[label="primModNatS0 (Succ vz3000) (Succ vz4000) (primGEqNatS (Succ vz3000) (Succ vz4000))",fontsize=16,color="black",shape="box"];49 -> 57[label="",style="solid", color="black", weight=3];
50[label="primModNatS0 (Succ vz3000) Zero (primGEqNatS (Succ vz3000) Zero)",fontsize=16,color="black",shape="box"];50 -> 58[label="",style="solid", color="black", weight=3];
51[label="primModNatS0 Zero (Succ vz4000) (primGEqNatS Zero (Succ vz4000))",fontsize=16,color="black",shape="box"];51 -> 59[label="",style="solid", color="black", weight=3];
52[label="primModNatS0 Zero Zero (primGEqNatS Zero Zero)",fontsize=16,color="black",shape="box"];52 -> 60[label="",style="solid", color="black", weight=3];
53[label="primModNatP0 (Succ vz3000) (Succ vz4000) (primGEqNatS (Succ vz3000) (Succ vz4000))",fontsize=16,color="black",shape="box"];53 -> 61[label="",style="solid", color="black", weight=3];
54[label="primModNatP0 (Succ vz3000) Zero (primGEqNatS (Succ vz3000) Zero)",fontsize=16,color="black",shape="box"];54 -> 62[label="",style="solid", color="black", weight=3];
55[label="primModNatP0 Zero (Succ vz4000) (primGEqNatS Zero (Succ vz4000))",fontsize=16,color="black",shape="box"];55 -> 63[label="",style="solid", color="black", weight=3];
56[label="primModNatP0 Zero Zero (primGEqNatS Zero Zero)",fontsize=16,color="black",shape="box"];56 -> 64[label="",style="solid", color="black", weight=3];
57 -> 548[label="",style="dashed", color="red", weight=0];
57[label="primModNatS0 (Succ vz3000) (Succ vz4000) (primGEqNatS vz3000 vz4000)",fontsize=16,color="magenta"];57 -> 549[label="",style="dashed", color="magenta", weight=3];
57 -> 550[label="",style="dashed", color="magenta", weight=3];
57 -> 551[label="",style="dashed", color="magenta", weight=3];
57 -> 552[label="",style="dashed", color="magenta", weight=3];
58[label="primModNatS0 (Succ vz3000) Zero True",fontsize=16,color="black",shape="box"];58 -> 67[label="",style="solid", color="black", weight=3];
59[label="primModNatS0 Zero (Succ vz4000) False",fontsize=16,color="black",shape="box"];59 -> 68[label="",style="solid", color="black", weight=3];
60[label="primModNatS0 Zero Zero True",fontsize=16,color="black",shape="box"];60 -> 69[label="",style="solid", color="black", weight=3];
61 -> 591[label="",style="dashed", color="red", weight=0];
61[label="primModNatP0 (Succ vz3000) (Succ vz4000) (primGEqNatS vz3000 vz4000)",fontsize=16,color="magenta"];61 -> 592[label="",style="dashed", color="magenta", weight=3];
61 -> 593[label="",style="dashed", color="magenta", weight=3];
61 -> 594[label="",style="dashed", color="magenta", weight=3];
61 -> 595[label="",style="dashed", color="magenta", weight=3];
62[label="primModNatP0 (Succ vz3000) Zero True",fontsize=16,color="black",shape="box"];62 -> 72[label="",style="solid", color="black", weight=3];
63[label="primModNatP0 Zero (Succ vz4000) False",fontsize=16,color="black",shape="box"];63 -> 73[label="",style="solid", color="black", weight=3];
64[label="primModNatP0 Zero Zero True",fontsize=16,color="black",shape="box"];64 -> 74[label="",style="solid", color="black", weight=3];
549[label="vz3000",fontsize=16,color="green",shape="box"];550[label="vz3000",fontsize=16,color="green",shape="box"];551[label="vz4000",fontsize=16,color="green",shape="box"];552[label="vz4000",fontsize=16,color="green",shape="box"];548[label="primModNatS0 (Succ vz50) (Succ vz51) (primGEqNatS vz52 vz53)",fontsize=16,color="burlywood",shape="triangle"];716[label="vz52/Succ vz520",fontsize=10,color="white",style="solid",shape="box"];548 -> 716[label="",style="solid", color="burlywood", weight=9];
716 -> 589[label="",style="solid", color="burlywood", weight=3];
717[label="vz52/Zero",fontsize=10,color="white",style="solid",shape="box"];548 -> 717[label="",style="solid", color="burlywood", weight=9];
717 -> 590[label="",style="solid", color="burlywood", weight=3];
67 -> 28[label="",style="dashed", color="red", weight=0];
67[label="primModNatS (primMinusNatS (Succ vz3000) Zero) (Succ Zero)",fontsize=16,color="magenta"];67 -> 79[label="",style="dashed", color="magenta", weight=3];
67 -> 80[label="",style="dashed", color="magenta", weight=3];
68[label="Succ Zero",fontsize=16,color="green",shape="box"];69 -> 28[label="",style="dashed", color="red", weight=0];
69[label="primModNatS (primMinusNatS Zero Zero) (Succ Zero)",fontsize=16,color="magenta"];69 -> 81[label="",style="dashed", color="magenta", weight=3];
69 -> 82[label="",style="dashed", color="magenta", weight=3];
592[label="vz4000",fontsize=16,color="green",shape="box"];593[label="vz3000",fontsize=16,color="green",shape="box"];594[label="vz3000",fontsize=16,color="green",shape="box"];595[label="vz4000",fontsize=16,color="green",shape="box"];591[label="primModNatP0 (Succ vz55) (Succ vz56) (primGEqNatS vz57 vz58)",fontsize=16,color="burlywood",shape="triangle"];720[label="vz57/Succ vz570",fontsize=10,color="white",style="solid",shape="box"];591 -> 720[label="",style="solid", color="burlywood", weight=9];
720 -> 632[label="",style="solid", color="burlywood", weight=3];
721[label="vz57/Zero",fontsize=10,color="white",style="solid",shape="box"];591 -> 721[label="",style="solid", color="burlywood", weight=9];
721 -> 633[label="",style="solid", color="burlywood", weight=3];
72 -> 30[label="",style="dashed", color="red", weight=0];
72[label="primModNatP (primMinusNatS (Succ vz3000) Zero) (Succ Zero)",fontsize=16,color="magenta"];72 -> 87[label="",style="dashed", color="magenta", weight=3];
72 -> 88[label="",style="dashed", color="magenta", weight=3];
73[label="primMinusNatS (Succ vz4000) Zero",fontsize=16,color="black",shape="triangle"];73 -> 89[label="",style="solid", color="black", weight=3];
74 -> 30[label="",style="dashed", color="red", weight=0];
74[label="primModNatP (primMinusNatS Zero Zero) (Succ Zero)",fontsize=16,color="magenta"];74 -> 90[label="",style="dashed", color="magenta", weight=3];
74 -> 91[label="",style="dashed", color="magenta", weight=3];
589[label="primModNatS0 (Succ vz50) (Succ vz51) (primGEqNatS (Succ vz520) vz53)",fontsize=16,color="burlywood",shape="box"];724[label="vz53/Succ vz530",fontsize=10,color="white",style="solid",shape="box"];589 -> 724[label="",style="solid", color="burlywood", weight=9];
724 -> 634[label="",style="solid", color="burlywood", weight=3];
725[label="vz53/Zero",fontsize=10,color="white",style="solid",shape="box"];589 -> 725[label="",style="solid", color="burlywood", weight=9];
725 -> 635[label="",style="solid", color="burlywood", weight=3];
590[label="primModNatS0 (Succ vz50) (Succ vz51) (primGEqNatS Zero vz53)",fontsize=16,color="burlywood",shape="box"];726[label="vz53/Succ vz530",fontsize=10,color="white",style="solid",shape="box"];590 -> 726[label="",style="solid", color="burlywood", weight=9];
726 -> 636[label="",style="solid", color="burlywood", weight=3];
727[label="vz53/Zero",fontsize=10,color="white",style="solid",shape="box"];590 -> 727[label="",style="solid", color="burlywood", weight=9];
727 -> 637[label="",style="solid", color="burlywood", weight=3];
79 -> 73[label="",style="dashed", color="red", weight=0];
79[label="primMinusNatS (Succ vz3000) Zero",fontsize=16,color="magenta"];79 -> 96[label="",style="dashed", color="magenta", weight=3];
80[label="Zero",fontsize=16,color="green",shape="box"];81[label="primMinusNatS Zero Zero",fontsize=16,color="black",shape="triangle"];81 -> 97[label="",style="solid", color="black", weight=3];
82[label="Zero",fontsize=16,color="green",shape="box"];632[label="primModNatP0 (Succ vz55) (Succ vz56) (primGEqNatS (Succ vz570) vz58)",fontsize=16,color="burlywood",shape="box"];729[label="vz58/Succ vz580",fontsize=10,color="white",style="solid",shape="box"];632 -> 729[label="",style="solid", color="burlywood", weight=9];
729 -> 638[label="",style="solid", color="burlywood", weight=3];
730[label="vz58/Zero",fontsize=10,color="white",style="solid",shape="box"];632 -> 730[label="",style="solid", color="burlywood", weight=9];
730 -> 639[label="",style="solid", color="burlywood", weight=3];
633[label="primModNatP0 (Succ vz55) (Succ vz56) (primGEqNatS Zero vz58)",fontsize=16,color="burlywood",shape="box"];731[label="vz58/Succ vz580",fontsize=10,color="white",style="solid",shape="box"];633 -> 731[label="",style="solid", color="burlywood", weight=9];
731 -> 640[label="",style="solid", color="burlywood", weight=3];
732[label="vz58/Zero",fontsize=10,color="white",style="solid",shape="box"];633 -> 732[label="",style="solid", color="burlywood", weight=9];
732 -> 641[label="",style="solid", color="burlywood", weight=3];
87 -> 73[label="",style="dashed", color="red", weight=0];
87[label="primMinusNatS (Succ vz3000) Zero",fontsize=16,color="magenta"];87 -> 102[label="",style="dashed", color="magenta", weight=3];
88[label="Zero",fontsize=16,color="green",shape="box"];89[label="Succ vz4000",fontsize=16,color="green",shape="box"];90 -> 81[label="",style="dashed", color="red", weight=0];
90[label="primMinusNatS Zero Zero",fontsize=16,color="magenta"];91[label="Zero",fontsize=16,color="green",shape="box"];634[label="primModNatS0 (Succ vz50) (Succ vz51) (primGEqNatS (Succ vz520) (Succ vz530))",fontsize=16,color="black",shape="box"];634 -> 642[label="",style="solid", color="black", weight=3];
635[label="primModNatS0 (Succ vz50) (Succ vz51) (primGEqNatS (Succ vz520) Zero)",fontsize=16,color="black",shape="box"];635 -> 643[label="",style="solid", color="black", weight=3];
636[label="primModNatS0 (Succ vz50) (Succ vz51) (primGEqNatS Zero (Succ vz530))",fontsize=16,color="black",shape="box"];636 -> 644[label="",style="solid", color="black", weight=3];
637[label="primModNatS0 (Succ vz50) (Succ vz51) (primGEqNatS Zero Zero)",fontsize=16,color="black",shape="box"];637 -> 645[label="",style="solid", color="black", weight=3];
96[label="vz3000",fontsize=16,color="green",shape="box"];97[label="Zero",fontsize=16,color="green",shape="box"];638[label="primModNatP0 (Succ vz55) (Succ vz56) (primGEqNatS (Succ vz570) (Succ vz580))",fontsize=16,color="black",shape="box"];638 -> 646[label="",style="solid", color="black", weight=3];
639[label="primModNatP0 (Succ vz55) (Succ vz56) (primGEqNatS (Succ vz570) Zero)",fontsize=16,color="black",shape="box"];639 -> 647[label="",style="solid", color="black", weight=3];
640[label="primModNatP0 (Succ vz55) (Succ vz56) (primGEqNatS Zero (Succ vz580))",fontsize=16,color="black",shape="box"];640 -> 648[label="",style="solid", color="black", weight=3];
641[label="primModNatP0 (Succ vz55) (Succ vz56) (primGEqNatS Zero Zero)",fontsize=16,color="black",shape="box"];641 -> 649[label="",style="solid", color="black", weight=3];
102[label="vz3000",fontsize=16,color="green",shape="box"];642 -> 548[label="",style="dashed", color="red", weight=0];
642[label="primModNatS0 (Succ vz50) (Succ vz51) (primGEqNatS vz520 vz530)",fontsize=16,color="magenta"];642 -> 650[label="",style="dashed", color="magenta", weight=3];
642 -> 651[label="",style="dashed", color="magenta", weight=3];
643[label="primModNatS0 (Succ vz50) (Succ vz51) True",fontsize=16,color="black",shape="triangle"];643 -> 652[label="",style="solid", color="black", weight=3];
644[label="primModNatS0 (Succ vz50) (Succ vz51) False",fontsize=16,color="black",shape="box"];644 -> 653[label="",style="solid", color="black", weight=3];
645 -> 643[label="",style="dashed", color="red", weight=0];
645[label="primModNatS0 (Succ vz50) (Succ vz51) True",fontsize=16,color="magenta"];646 -> 591[label="",style="dashed", color="red", weight=0];
646[label="primModNatP0 (Succ vz55) (Succ vz56) (primGEqNatS vz570 vz580)",fontsize=16,color="magenta"];646 -> 654[label="",style="dashed", color="magenta", weight=3];
646 -> 655[label="",style="dashed", color="magenta", weight=3];
647[label="primModNatP0 (Succ vz55) (Succ vz56) True",fontsize=16,color="black",shape="triangle"];647 -> 656[label="",style="solid", color="black", weight=3];
648[label="primModNatP0 (Succ vz55) (Succ vz56) False",fontsize=16,color="black",shape="box"];648 -> 657[label="",style="solid", color="black", weight=3];
649 -> 647[label="",style="dashed", color="red", weight=0];
649[label="primModNatP0 (Succ vz55) (Succ vz56) True",fontsize=16,color="magenta"];650[label="vz520",fontsize=16,color="green",shape="box"];651[label="vz530",fontsize=16,color="green",shape="box"];652 -> 28[label="",style="dashed", color="red", weight=0];
652[label="primModNatS (primMinusNatS (Succ vz50) (Succ vz51)) (Succ (Succ vz51))",fontsize=16,color="magenta"];652 -> 658[label="",style="dashed", color="magenta", weight=3];
652 -> 659[label="",style="dashed", color="magenta", weight=3];
653[label="Succ (Succ vz50)",fontsize=16,color="green",shape="box"];654[label="vz570",fontsize=16,color="green",shape="box"];655[label="vz580",fontsize=16,color="green",shape="box"];656 -> 30[label="",style="dashed", color="red", weight=0];
656[label="primModNatP (primMinusNatS (Succ vz55) (Succ vz56)) (Succ (Succ vz56))",fontsize=16,color="magenta"];656 -> 660[label="",style="dashed", color="magenta", weight=3];
656 -> 661[label="",style="dashed", color="magenta", weight=3];
657[label="primMinusNatS (Succ vz56) (Succ vz55)",fontsize=16,color="black",shape="triangle"];657 -> 662[label="",style="solid", color="black", weight=3];
658 -> 657[label="",style="dashed", color="red", weight=0];
658[label="primMinusNatS (Succ vz50) (Succ vz51)",fontsize=16,color="magenta"];658 -> 663[label="",style="dashed", color="magenta", weight=3];
658 -> 664[label="",style="dashed", color="magenta", weight=3];
659[label="Succ vz51",fontsize=16,color="green",shape="box"];660 -> 657[label="",style="dashed", color="red", weight=0];
660[label="primMinusNatS (Succ vz55) (Succ vz56)",fontsize=16,color="magenta"];660 -> 665[label="",style="dashed", color="magenta", weight=3];
660 -> 666[label="",style="dashed", color="magenta", weight=3];
661[label="Succ vz56",fontsize=16,color="green",shape="box"];662[label="primMinusNatS vz56 vz55",fontsize=16,color="burlywood",shape="triangle"];743[label="vz56/Succ vz560",fontsize=10,color="white",style="solid",shape="box"];662 -> 743[label="",style="solid", color="burlywood", weight=9];
743 -> 667[label="",style="solid", color="burlywood", weight=3];
744[label="vz56/Zero",fontsize=10,color="white",style="solid",shape="box"];662 -> 744[label="",style="solid", color="burlywood", weight=9];
744 -> 668[label="",style="solid", color="burlywood", weight=3];
663[label="vz50",fontsize=16,color="green",shape="box"];664[label="vz51",fontsize=16,color="green",shape="box"];665[label="vz55",fontsize=16,color="green",shape="box"];666[label="vz56",fontsize=16,color="green",shape="box"];667[label="primMinusNatS (Succ vz560) vz55",fontsize=16,color="burlywood",shape="box"];745[label="vz55/Succ vz550",fontsize=10,color="white",style="solid",shape="box"];667 -> 745[label="",style="solid", color="burlywood", weight=9];
745 -> 669[label="",style="solid", color="burlywood", weight=3];
746[label="vz55/Zero",fontsize=10,color="white",style="solid",shape="box"];667 -> 746[label="",style="solid", color="burlywood", weight=9];
746 -> 670[label="",style="solid", color="burlywood", weight=3];
668[label="primMinusNatS Zero vz55",fontsize=16,color="burlywood",shape="box"];747[label="vz55/Succ vz550",fontsize=10,color="white",style="solid",shape="box"];668 -> 747[label="",style="solid", color="burlywood", weight=9];
747 -> 671[label="",style="solid", color="burlywood", weight=3];
748[label="vz55/Zero",fontsize=10,color="white",style="solid",shape="box"];668 -> 748[label="",style="solid", color="burlywood", weight=9];
748 -> 672[label="",style="solid", color="burlywood", weight=3];
669[label="primMinusNatS (Succ vz560) (Succ vz550)",fontsize=16,color="black",shape="box"];669 -> 673[label="",style="solid", color="black", weight=3];
670[label="primMinusNatS (Succ vz560) Zero",fontsize=16,color="black",shape="box"];670 -> 674[label="",style="solid", color="black", weight=3];
671[label="primMinusNatS Zero (Succ vz550)",fontsize=16,color="black",shape="box"];671 -> 675[label="",style="solid", color="black", weight=3];
672[label="primMinusNatS Zero Zero",fontsize=16,color="black",shape="box"];672 -> 676[label="",style="solid", color="black", weight=3];
673 -> 662[label="",style="dashed", color="red", weight=0];
673[label="primMinusNatS vz560 vz550",fontsize=16,color="magenta"];673 -> 677[label="",style="dashed", color="magenta", weight=3];
673 -> 678[label="",style="dashed", color="magenta", weight=3];
674[label="Succ vz560",fontsize=16,color="green",shape="box"];675[label="Zero",fontsize=16,color="green",shape="box"];676[label="Zero",fontsize=16,color="green",shape="box"];677[label="vz560",fontsize=16,color="green",shape="box"];678[label="vz550",fontsize=16,color="green",shape="box"];}

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                    ↳ QDPSizeChangeProof

                  ↳ QDP

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primMinusNatS(Succ(vz560), Succ(vz550)) → new_primMinusNatS(vz560, vz550)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

new_primMinusNatS(Succ(vz560), Succ(vz550)) → new_primMinusNatS(vz560, vz550)
The graph contains the following edges 1 > 1, 2 > 2

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primModNatP0(vz55, vz56, Zero, Zero) → new_primModNatP00(vz55, vz56)
new_primModNatP(Succ(Succ(vz3000)), Zero) → new_primModNatP(new_primMinusNatS0(vz3000), Zero)
new_primModNatP0(vz55, vz56, Succ(vz570), Zero) → new_primModNatP(new_primMinusNatS2(vz55, vz56), Succ(vz56))
new_primModNatP0(vz55, vz56, Succ(vz570), Succ(vz580)) → new_primModNatP0(vz55, vz56, vz570, vz580)
new_primModNatP(Succ(Zero), Zero) → new_primModNatP(new_primMinusNatS1, Zero)
new_primModNatP00(vz55, vz56) → new_primModNatP(new_primMinusNatS2(vz55, vz56), Succ(vz56))
new_primModNatP(Succ(Succ(vz3000)), Succ(vz4000)) → new_primModNatP0(vz3000, vz4000, vz3000, vz4000)

The TRS R consists of the following rules:

new_primMinusNatS3(Zero, Succ(vz550)) → Zero
new_primMinusNatS3(Succ(vz560), Succ(vz550)) → new_primMinusNatS3(vz560, vz550)
new_primMinusNatS1 → Zero
new_primMinusNatS2(vz56, vz55) → new_primMinusNatS3(vz56, vz55)
new_primMinusNatS3(Zero, Zero) → Zero
new_primMinusNatS0(vz4000) → Succ(vz4000)
new_primMinusNatS3(Succ(vz560), Zero) → Succ(vz560)

The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS2(x0, x1)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS1
new_primMinusNatS3(Succ(x0), Zero)
new_primMinusNatS0(x0)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 2 SCCs with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                          ↳ UsableRulesProof

                        ↳ QDP

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primModNatP(Succ(Succ(vz3000)), Zero) → new_primModNatP(new_primMinusNatS0(vz3000), Zero)

The TRS R consists of the following rules:

new_primMinusNatS3(Zero, Succ(vz550)) → Zero
new_primMinusNatS3(Succ(vz560), Succ(vz550)) → new_primMinusNatS3(vz560, vz550)
new_primMinusNatS1 → Zero
new_primMinusNatS2(vz56, vz55) → new_primMinusNatS3(vz56, vz55)
new_primMinusNatS3(Zero, Zero) → Zero
new_primMinusNatS0(vz4000) → Succ(vz4000)
new_primMinusNatS3(Succ(vz560), Zero) → Succ(vz560)

The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS2(x0, x1)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS1
new_primMinusNatS3(Succ(x0), Zero)
new_primMinusNatS0(x0)

We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [15] we can delete all non-usable rules [17] from R.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

                        ↳ QDP

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primModNatP(Succ(Succ(vz3000)), Zero) → new_primModNatP(new_primMinusNatS0(vz3000), Zero)

The TRS R consists of the following rules:

new_primMinusNatS0(vz4000) → Succ(vz4000)

The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS2(x0, x1)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS1
new_primMinusNatS3(Succ(x0), Zero)
new_primMinusNatS0(x0)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS2(x0, x1)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS1
new_primMinusNatS3(Succ(x0), Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

                                ↳ QDP

                                  ↳ RuleRemovalProof

                        ↳ QDP

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primModNatP(Succ(Succ(vz3000)), Zero) → new_primModNatP(new_primMinusNatS0(vz3000), Zero)

The TRS R consists of the following rules:

new_primMinusNatS0(vz4000) → Succ(vz4000)

The set Q consists of the following terms:

new_primMinusNatS0(x0)

We have to consider all minimal (P,Q,R)-chains.
By using the rule removal processor [15] with the following polynomial ordering [25], at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented.
Strictly oriented dependency pairs:

new_primModNatP(Succ(Succ(vz3000)), Zero) → new_primModNatP(new_primMinusNatS0(vz3000), Zero)

Strictly oriented rules of the TRS R:

new_primMinusNatS0(vz4000) → Succ(vz4000)

Used ordering: POLO with Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + 2·x₁
POL(Zero) = 0
POL(new_primMinusNatS0(x₁)) = 2 + 2·x₁
POL(new_primModNatP(x₁, x₂)) = x₁ + x₂

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

                                ↳ QDP

                                  ↳ RuleRemovalProof

                                    ↳ QDP

                                      ↳ PisEmptyProof

                        ↳ QDP

                  ↳ QDP

Q DP problem:
P is empty.
R is empty.
The set Q consists of the following terms:

new_primMinusNatS0(x0)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                        ↳ QDP

                          ↳ UsableRulesProof

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primModNatP0(vz55, vz56, Zero, Zero) → new_primModNatP00(vz55, vz56)
new_primModNatP0(vz55, vz56, Succ(vz570), Zero) → new_primModNatP(new_primMinusNatS2(vz55, vz56), Succ(vz56))
new_primModNatP0(vz55, vz56, Succ(vz570), Succ(vz580)) → new_primModNatP0(vz55, vz56, vz570, vz580)
new_primModNatP00(vz55, vz56) → new_primModNatP(new_primMinusNatS2(vz55, vz56), Succ(vz56))
new_primModNatP(Succ(Succ(vz3000)), Succ(vz4000)) → new_primModNatP0(vz3000, vz4000, vz3000, vz4000)

The TRS R consists of the following rules:

new_primMinusNatS3(Zero, Succ(vz550)) → Zero
new_primMinusNatS3(Succ(vz560), Succ(vz550)) → new_primMinusNatS3(vz560, vz550)
new_primMinusNatS1 → Zero
new_primMinusNatS2(vz56, vz55) → new_primMinusNatS3(vz56, vz55)
new_primMinusNatS3(Zero, Zero) → Zero
new_primMinusNatS0(vz4000) → Succ(vz4000)
new_primMinusNatS3(Succ(vz560), Zero) → Succ(vz560)

The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS2(x0, x1)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS1
new_primMinusNatS3(Succ(x0), Zero)
new_primMinusNatS0(x0)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primModNatP0(vz55, vz56, Zero, Zero) → new_primModNatP00(vz55, vz56)
new_primModNatP0(vz55, vz56, Succ(vz570), Zero) → new_primModNatP(new_primMinusNatS2(vz55, vz56), Succ(vz56))
new_primModNatP0(vz55, vz56, Succ(vz570), Succ(vz580)) → new_primModNatP0(vz55, vz56, vz570, vz580)
new_primModNatP00(vz55, vz56) → new_primModNatP(new_primMinusNatS2(vz55, vz56), Succ(vz56))
new_primModNatP(Succ(Succ(vz3000)), Succ(vz4000)) → new_primModNatP0(vz3000, vz4000, vz3000, vz4000)

The TRS R consists of the following rules:

new_primMinusNatS2(vz56, vz55) → new_primMinusNatS3(vz56, vz55)
new_primMinusNatS3(Zero, Succ(vz550)) → Zero
new_primMinusNatS3(Succ(vz560), Succ(vz550)) → new_primMinusNatS3(vz560, vz550)
new_primMinusNatS3(Zero, Zero) → Zero
new_primMinusNatS3(Succ(vz560), Zero) → Succ(vz560)

The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS2(x0, x1)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS1
new_primMinusNatS3(Succ(x0), Zero)
new_primMinusNatS0(x0)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS1
new_primMinusNatS0(x0)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

                                ↳ QDP

                                  ↳ Rewriting

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primModNatP0(vz55, vz56, Zero, Zero) → new_primModNatP00(vz55, vz56)
new_primModNatP0(vz55, vz56, Succ(vz570), Zero) → new_primModNatP(new_primMinusNatS2(vz55, vz56), Succ(vz56))
new_primModNatP0(vz55, vz56, Succ(vz570), Succ(vz580)) → new_primModNatP0(vz55, vz56, vz570, vz580)
new_primModNatP00(vz55, vz56) → new_primModNatP(new_primMinusNatS2(vz55, vz56), Succ(vz56))
new_primModNatP(Succ(Succ(vz3000)), Succ(vz4000)) → new_primModNatP0(vz3000, vz4000, vz3000, vz4000)

The TRS R consists of the following rules:

new_primMinusNatS2(vz56, vz55) → new_primMinusNatS3(vz56, vz55)
new_primMinusNatS3(Zero, Succ(vz550)) → Zero
new_primMinusNatS3(Succ(vz560), Succ(vz550)) → new_primMinusNatS3(vz560, vz550)
new_primMinusNatS3(Zero, Zero) → Zero
new_primMinusNatS3(Succ(vz560), Zero) → Succ(vz560)

The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS2(x0, x1)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS3(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_primModNatP0(vz55, vz56, Succ(vz570), Zero) → new_primModNatP(new_primMinusNatS2(vz55, vz56), Succ(vz56)) at position [0] we obtained the following new rules:

new_primModNatP0(vz55, vz56, Succ(vz570), Zero) → new_primModNatP(new_primMinusNatS3(vz55, vz56), Succ(vz56))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

                                ↳ QDP

                                  ↳ Rewriting

                                    ↳ QDP

                                      ↳ Rewriting

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primModNatP0(vz55, vz56, Succ(vz570), Zero) → new_primModNatP(new_primMinusNatS3(vz55, vz56), Succ(vz56))
new_primModNatP0(vz55, vz56, Zero, Zero) → new_primModNatP00(vz55, vz56)
new_primModNatP0(vz55, vz56, Succ(vz570), Succ(vz580)) → new_primModNatP0(vz55, vz56, vz570, vz580)
new_primModNatP00(vz55, vz56) → new_primModNatP(new_primMinusNatS2(vz55, vz56), Succ(vz56))
new_primModNatP(Succ(Succ(vz3000)), Succ(vz4000)) → new_primModNatP0(vz3000, vz4000, vz3000, vz4000)

The TRS R consists of the following rules:

new_primMinusNatS2(vz56, vz55) → new_primMinusNatS3(vz56, vz55)
new_primMinusNatS3(Zero, Succ(vz550)) → Zero
new_primMinusNatS3(Succ(vz560), Succ(vz550)) → new_primMinusNatS3(vz560, vz550)
new_primMinusNatS3(Zero, Zero) → Zero
new_primMinusNatS3(Succ(vz560), Zero) → Succ(vz560)

The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS2(x0, x1)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS3(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_primModNatP00(vz55, vz56) → new_primModNatP(new_primMinusNatS2(vz55, vz56), Succ(vz56)) at position [0] we obtained the following new rules:

new_primModNatP00(vz55, vz56) → new_primModNatP(new_primMinusNatS3(vz55, vz56), Succ(vz56))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

                                ↳ QDP

                                  ↳ Rewriting

                                    ↳ QDP

                                      ↳ Rewriting

                                        ↳ QDP

                                          ↳ UsableRulesProof

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primModNatP0(vz55, vz56, Zero, Zero) → new_primModNatP00(vz55, vz56)
new_primModNatP0(vz55, vz56, Succ(vz570), Zero) → new_primModNatP(new_primMinusNatS3(vz55, vz56), Succ(vz56))
new_primModNatP0(vz55, vz56, Succ(vz570), Succ(vz580)) → new_primModNatP0(vz55, vz56, vz570, vz580)
new_primModNatP00(vz55, vz56) → new_primModNatP(new_primMinusNatS3(vz55, vz56), Succ(vz56))
new_primModNatP(Succ(Succ(vz3000)), Succ(vz4000)) → new_primModNatP0(vz3000, vz4000, vz3000, vz4000)

The TRS R consists of the following rules:

new_primMinusNatS2(vz56, vz55) → new_primMinusNatS3(vz56, vz55)
new_primMinusNatS3(Zero, Succ(vz550)) → Zero
new_primMinusNatS3(Succ(vz560), Succ(vz550)) → new_primMinusNatS3(vz560, vz550)
new_primMinusNatS3(Zero, Zero) → Zero
new_primMinusNatS3(Succ(vz560), Zero) → Succ(vz560)

The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS2(x0, x1)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS3(Succ(x0), Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

                                ↳ QDP

                                  ↳ Rewriting

                                    ↳ QDP

                                      ↳ Rewriting

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primModNatP0(vz55, vz56, Succ(vz570), Zero) → new_primModNatP(new_primMinusNatS3(vz55, vz56), Succ(vz56))
new_primModNatP0(vz55, vz56, Zero, Zero) → new_primModNatP00(vz55, vz56)
new_primModNatP0(vz55, vz56, Succ(vz570), Succ(vz580)) → new_primModNatP0(vz55, vz56, vz570, vz580)
new_primModNatP00(vz55, vz56) → new_primModNatP(new_primMinusNatS3(vz55, vz56), Succ(vz56))
new_primModNatP(Succ(Succ(vz3000)), Succ(vz4000)) → new_primModNatP0(vz3000, vz4000, vz3000, vz4000)

The TRS R consists of the following rules:

new_primMinusNatS3(Zero, Succ(vz550)) → Zero
new_primMinusNatS3(Succ(vz560), Succ(vz550)) → new_primMinusNatS3(vz560, vz550)
new_primMinusNatS3(Zero, Zero) → Zero
new_primMinusNatS3(Succ(vz560), Zero) → Succ(vz560)

The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS2(x0, x1)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS3(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS2(x0, x1)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

                                ↳ QDP

                                  ↳ Rewriting

                                    ↳ QDP

                                      ↳ Rewriting

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primModNatP0(vz55, vz56, Zero, Zero) → new_primModNatP00(vz55, vz56)
new_primModNatP0(vz55, vz56, Succ(vz570), Zero) → new_primModNatP(new_primMinusNatS3(vz55, vz56), Succ(vz56))
new_primModNatP0(vz55, vz56, Succ(vz570), Succ(vz580)) → new_primModNatP0(vz55, vz56, vz570, vz580)
new_primModNatP00(vz55, vz56) → new_primModNatP(new_primMinusNatS3(vz55, vz56), Succ(vz56))
new_primModNatP(Succ(Succ(vz3000)), Succ(vz4000)) → new_primModNatP0(vz3000, vz4000, vz3000, vz4000)

The TRS R consists of the following rules:

new_primMinusNatS3(Zero, Succ(vz550)) → Zero
new_primMinusNatS3(Succ(vz560), Succ(vz550)) → new_primMinusNatS3(vz560, vz550)
new_primMinusNatS3(Zero, Zero) → Zero
new_primMinusNatS3(Succ(vz560), Zero) → Succ(vz560)

The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS3(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_primModNatP0(vz55, vz56, Succ(vz570), Zero) → new_primModNatP(new_primMinusNatS3(vz55, vz56), Succ(vz56))
new_primModNatP00(vz55, vz56) → new_primModNatP(new_primMinusNatS3(vz55, vz56), Succ(vz56))
new_primModNatP(Succ(Succ(vz3000)), Succ(vz4000)) → new_primModNatP0(vz3000, vz4000, vz3000, vz4000)

The remaining pairs can at least be oriented weakly.

new_primModNatP0(vz55, vz56, Zero, Zero) → new_primModNatP00(vz55, vz56)
new_primModNatP0(vz55, vz56, Succ(vz570), Succ(vz580)) → new_primModNatP0(vz55, vz56, vz570, vz580)

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_primMinusNatS3(x₁, x₂)) = x₁
POL(new_primModNatP(x₁, x₂)) = x₁
POL(new_primModNatP0(x₁, x₂, x₃, x₄)) = 1 + x₁
POL(new_primModNatP00(x₁, x₂)) = 1 + x₁

The following usable rules [17] were oriented:

new_primMinusNatS3(Succ(vz560), Zero) → Succ(vz560)
new_primMinusNatS3(Zero, Zero) → Zero
new_primMinusNatS3(Zero, Succ(vz550)) → Zero
new_primMinusNatS3(Succ(vz560), Succ(vz550)) → new_primMinusNatS3(vz560, vz550)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

                                ↳ QDP

                                  ↳ Rewriting

                                    ↳ QDP

                                      ↳ Rewriting

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primModNatP0(vz55, vz56, Zero, Zero) → new_primModNatP00(vz55, vz56)
new_primModNatP0(vz55, vz56, Succ(vz570), Succ(vz580)) → new_primModNatP0(vz55, vz56, vz570, vz580)

The TRS R consists of the following rules:

new_primMinusNatS3(Zero, Succ(vz550)) → Zero
new_primMinusNatS3(Succ(vz560), Succ(vz550)) → new_primMinusNatS3(vz560, vz550)
new_primMinusNatS3(Zero, Zero) → Zero
new_primMinusNatS3(Succ(vz560), Zero) → Succ(vz560)

The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS3(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

                                ↳ QDP

                                  ↳ Rewriting

                                    ↳ QDP

                                      ↳ Rewriting

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primModNatP0(vz55, vz56, Succ(vz570), Succ(vz580)) → new_primModNatP0(vz55, vz56, vz570, vz580)

The TRS R consists of the following rules:

new_primMinusNatS3(Zero, Succ(vz550)) → Zero
new_primMinusNatS3(Succ(vz560), Succ(vz550)) → new_primMinusNatS3(vz560, vz550)
new_primMinusNatS3(Zero, Zero) → Zero
new_primMinusNatS3(Succ(vz560), Zero) → Succ(vz560)

The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS3(Succ(x0), Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

                                ↳ QDP

                                  ↳ Rewriting

                                    ↳ QDP

                                      ↳ Rewriting

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                                                            ↳ QDP

                                                              ↳ QReductionProof

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primModNatP0(vz55, vz56, Succ(vz570), Succ(vz580)) → new_primModNatP0(vz55, vz56, vz570, vz580)

R is empty.
The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS3(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS3(Succ(x0), Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

                                ↳ QDP

                                  ↳ Rewriting

                                    ↳ QDP

                                      ↳ Rewriting

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                                                            ↳ QDP

                                                              ↳ QReductionProof

                                                                ↳ QDP

                                                                  ↳ QDPSizeChangeProof

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primModNatP0(vz55, vz56, Succ(vz570), Succ(vz580)) → new_primModNatP0(vz55, vz56, vz570, vz580)

From the DPs we obtained the following set of size-change graphs:

new_primModNatP0(vz55, vz56, Succ(vz570), Succ(vz580)) → new_primModNatP0(vz55, vz56, vz570, vz580)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 > 4

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

new_primModNatS0(vz50, vz51, Succ(vz520), Zero) → new_primModNatS(new_primMinusNatS2(vz50, vz51), Succ(vz51))
new_primModNatS00(vz50, vz51) → new_primModNatS(new_primMinusNatS2(vz50, vz51), Succ(vz51))
new_primModNatS(Succ(Zero), Zero) → new_primModNatS(new_primMinusNatS1, Zero)
new_primModNatS(Succ(Succ(vz3000)), Succ(vz4000)) → new_primModNatS0(vz3000, vz4000, vz3000, vz4000)
new_primModNatS(Succ(Succ(vz3000)), Zero) → new_primModNatS(new_primMinusNatS0(vz3000), Zero)
new_primModNatS0(vz50, vz51, Succ(vz520), Succ(vz530)) → new_primModNatS0(vz50, vz51, vz520, vz530)
new_primModNatS0(vz50, vz51, Zero, Zero) → new_primModNatS00(vz50, vz51)

The TRS R consists of the following rules:

new_primMinusNatS3(Zero, Succ(vz550)) → Zero
new_primMinusNatS3(Succ(vz560), Succ(vz550)) → new_primMinusNatS3(vz560, vz550)
new_primMinusNatS1 → Zero
new_primMinusNatS2(vz56, vz55) → new_primMinusNatS3(vz56, vz55)
new_primMinusNatS3(Zero, Zero) → Zero
new_primMinusNatS0(vz4000) → Succ(vz4000)
new_primMinusNatS3(Succ(vz560), Zero) → Succ(vz560)

The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS2(x0, x1)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS1
new_primMinusNatS3(Succ(x0), Zero)
new_primMinusNatS0(x0)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 2 SCCs with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                          ↳ UsableRulesProof

                        ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primModNatS(Succ(Succ(vz3000)), Zero) → new_primModNatS(new_primMinusNatS0(vz3000), Zero)

The TRS R consists of the following rules:

new_primMinusNatS3(Zero, Succ(vz550)) → Zero
new_primMinusNatS3(Succ(vz560), Succ(vz550)) → new_primMinusNatS3(vz560, vz550)
new_primMinusNatS1 → Zero
new_primMinusNatS2(vz56, vz55) → new_primMinusNatS3(vz56, vz55)
new_primMinusNatS3(Zero, Zero) → Zero
new_primMinusNatS0(vz4000) → Succ(vz4000)
new_primMinusNatS3(Succ(vz560), Zero) → Succ(vz560)

The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS2(x0, x1)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS1
new_primMinusNatS3(Succ(x0), Zero)
new_primMinusNatS0(x0)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

                        ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primModNatS(Succ(Succ(vz3000)), Zero) → new_primModNatS(new_primMinusNatS0(vz3000), Zero)

The TRS R consists of the following rules:

new_primMinusNatS0(vz4000) → Succ(vz4000)

The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS2(x0, x1)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS1
new_primMinusNatS3(Succ(x0), Zero)
new_primMinusNatS0(x0)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS2(x0, x1)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS1
new_primMinusNatS3(Succ(x0), Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

                                ↳ QDP

                                  ↳ RuleRemovalProof

                        ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primModNatS(Succ(Succ(vz3000)), Zero) → new_primModNatS(new_primMinusNatS0(vz3000), Zero)

The TRS R consists of the following rules:

new_primMinusNatS0(vz4000) → Succ(vz4000)

The set Q consists of the following terms:

new_primMinusNatS0(x0)

new_primModNatS(Succ(Succ(vz3000)), Zero) → new_primModNatS(new_primMinusNatS0(vz3000), Zero)

Strictly oriented rules of the TRS R:

new_primMinusNatS0(vz4000) → Succ(vz4000)

Used ordering: POLO with Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + 2·x₁
POL(Zero) = 0
POL(new_primMinusNatS0(x₁)) = 2 + 2·x₁
POL(new_primModNatS(x₁, x₂)) = x₁ + x₂

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

                                ↳ QDP

                                  ↳ RuleRemovalProof

                                    ↳ QDP

                                      ↳ PisEmptyProof

                        ↳ QDP

Q DP problem:
P is empty.
R is empty.
The set Q consists of the following terms:

new_primMinusNatS0(x0)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                        ↳ QDP

                          ↳ UsableRulesProof

Q DP problem:
The TRS P consists of the following rules:

new_primModNatS0(vz50, vz51, Succ(vz520), Zero) → new_primModNatS(new_primMinusNatS2(vz50, vz51), Succ(vz51))
new_primModNatS00(vz50, vz51) → new_primModNatS(new_primMinusNatS2(vz50, vz51), Succ(vz51))
new_primModNatS(Succ(Succ(vz3000)), Succ(vz4000)) → new_primModNatS0(vz3000, vz4000, vz3000, vz4000)
new_primModNatS0(vz50, vz51, Succ(vz520), Succ(vz530)) → new_primModNatS0(vz50, vz51, vz520, vz530)
new_primModNatS0(vz50, vz51, Zero, Zero) → new_primModNatS00(vz50, vz51)

The TRS R consists of the following rules:

new_primMinusNatS3(Zero, Succ(vz550)) → Zero
new_primMinusNatS3(Succ(vz560), Succ(vz550)) → new_primMinusNatS3(vz560, vz550)
new_primMinusNatS1 → Zero
new_primMinusNatS2(vz56, vz55) → new_primMinusNatS3(vz56, vz55)
new_primMinusNatS3(Zero, Zero) → Zero
new_primMinusNatS0(vz4000) → Succ(vz4000)
new_primMinusNatS3(Succ(vz560), Zero) → Succ(vz560)

The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS2(x0, x1)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS1
new_primMinusNatS3(Succ(x0), Zero)
new_primMinusNatS0(x0)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

Q DP problem:
The TRS P consists of the following rules:

new_primModNatS0(vz50, vz51, Succ(vz520), Zero) → new_primModNatS(new_primMinusNatS2(vz50, vz51), Succ(vz51))
new_primModNatS00(vz50, vz51) → new_primModNatS(new_primMinusNatS2(vz50, vz51), Succ(vz51))
new_primModNatS(Succ(Succ(vz3000)), Succ(vz4000)) → new_primModNatS0(vz3000, vz4000, vz3000, vz4000)
new_primModNatS0(vz50, vz51, Succ(vz520), Succ(vz530)) → new_primModNatS0(vz50, vz51, vz520, vz530)
new_primModNatS0(vz50, vz51, Zero, Zero) → new_primModNatS00(vz50, vz51)

The TRS R consists of the following rules:

new_primMinusNatS2(vz56, vz55) → new_primMinusNatS3(vz56, vz55)
new_primMinusNatS3(Zero, Succ(vz550)) → Zero
new_primMinusNatS3(Succ(vz560), Succ(vz550)) → new_primMinusNatS3(vz560, vz550)
new_primMinusNatS3(Zero, Zero) → Zero
new_primMinusNatS3(Succ(vz560), Zero) → Succ(vz560)

The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS2(x0, x1)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS1
new_primMinusNatS3(Succ(x0), Zero)
new_primMinusNatS0(x0)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS1
new_primMinusNatS0(x0)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

                                ↳ QDP

                                  ↳ Rewriting

Q DP problem:
The TRS P consists of the following rules:

new_primModNatS0(vz50, vz51, Succ(vz520), Zero) → new_primModNatS(new_primMinusNatS2(vz50, vz51), Succ(vz51))
new_primModNatS00(vz50, vz51) → new_primModNatS(new_primMinusNatS2(vz50, vz51), Succ(vz51))
new_primModNatS(Succ(Succ(vz3000)), Succ(vz4000)) → new_primModNatS0(vz3000, vz4000, vz3000, vz4000)
new_primModNatS0(vz50, vz51, Zero, Zero) → new_primModNatS00(vz50, vz51)
new_primModNatS0(vz50, vz51, Succ(vz520), Succ(vz530)) → new_primModNatS0(vz50, vz51, vz520, vz530)

The TRS R consists of the following rules:

new_primMinusNatS2(vz56, vz55) → new_primMinusNatS3(vz56, vz55)
new_primMinusNatS3(Zero, Succ(vz550)) → Zero
new_primMinusNatS3(Succ(vz560), Succ(vz550)) → new_primMinusNatS3(vz560, vz550)
new_primMinusNatS3(Zero, Zero) → Zero
new_primMinusNatS3(Succ(vz560), Zero) → Succ(vz560)

The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS2(x0, x1)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS3(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_primModNatS0(vz50, vz51, Succ(vz520), Zero) → new_primModNatS(new_primMinusNatS2(vz50, vz51), Succ(vz51)) at position [0] we obtained the following new rules:

new_primModNatS0(vz50, vz51, Succ(vz520), Zero) → new_primModNatS(new_primMinusNatS3(vz50, vz51), Succ(vz51))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

                                ↳ QDP

                                  ↳ Rewriting

                                    ↳ QDP

                                      ↳ Rewriting

Q DP problem:
The TRS P consists of the following rules:

new_primModNatS00(vz50, vz51) → new_primModNatS(new_primMinusNatS2(vz50, vz51), Succ(vz51))
new_primModNatS0(vz50, vz51, Succ(vz520), Zero) → new_primModNatS(new_primMinusNatS3(vz50, vz51), Succ(vz51))
new_primModNatS(Succ(Succ(vz3000)), Succ(vz4000)) → new_primModNatS0(vz3000, vz4000, vz3000, vz4000)
new_primModNatS0(vz50, vz51, Succ(vz520), Succ(vz530)) → new_primModNatS0(vz50, vz51, vz520, vz530)
new_primModNatS0(vz50, vz51, Zero, Zero) → new_primModNatS00(vz50, vz51)

The TRS R consists of the following rules:

new_primMinusNatS2(vz56, vz55) → new_primMinusNatS3(vz56, vz55)
new_primMinusNatS3(Zero, Succ(vz550)) → Zero
new_primMinusNatS3(Succ(vz560), Succ(vz550)) → new_primMinusNatS3(vz560, vz550)
new_primMinusNatS3(Zero, Zero) → Zero
new_primMinusNatS3(Succ(vz560), Zero) → Succ(vz560)

The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS2(x0, x1)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS3(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_primModNatS00(vz50, vz51) → new_primModNatS(new_primMinusNatS2(vz50, vz51), Succ(vz51)) at position [0] we obtained the following new rules:

new_primModNatS00(vz50, vz51) → new_primModNatS(new_primMinusNatS3(vz50, vz51), Succ(vz51))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

                                ↳ QDP

                                  ↳ Rewriting

                                    ↳ QDP

                                      ↳ Rewriting

                                        ↳ QDP

                                          ↳ UsableRulesProof

Q DP problem:
The TRS P consists of the following rules:

new_primModNatS0(vz50, vz51, Succ(vz520), Zero) → new_primModNatS(new_primMinusNatS3(vz50, vz51), Succ(vz51))
new_primModNatS(Succ(Succ(vz3000)), Succ(vz4000)) → new_primModNatS0(vz3000, vz4000, vz3000, vz4000)
new_primModNatS00(vz50, vz51) → new_primModNatS(new_primMinusNatS3(vz50, vz51), Succ(vz51))
new_primModNatS0(vz50, vz51, Zero, Zero) → new_primModNatS00(vz50, vz51)
new_primModNatS0(vz50, vz51, Succ(vz520), Succ(vz530)) → new_primModNatS0(vz50, vz51, vz520, vz530)

The TRS R consists of the following rules:

new_primMinusNatS2(vz56, vz55) → new_primMinusNatS3(vz56, vz55)
new_primMinusNatS3(Zero, Succ(vz550)) → Zero
new_primMinusNatS3(Succ(vz560), Succ(vz550)) → new_primMinusNatS3(vz560, vz550)
new_primMinusNatS3(Zero, Zero) → Zero
new_primMinusNatS3(Succ(vz560), Zero) → Succ(vz560)

The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS2(x0, x1)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS3(Succ(x0), Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

                                ↳ QDP

                                  ↳ Rewriting

                                    ↳ QDP

                                      ↳ Rewriting

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

Q DP problem:
The TRS P consists of the following rules:

new_primModNatS0(vz50, vz51, Succ(vz520), Zero) → new_primModNatS(new_primMinusNatS3(vz50, vz51), Succ(vz51))
new_primModNatS(Succ(Succ(vz3000)), Succ(vz4000)) → new_primModNatS0(vz3000, vz4000, vz3000, vz4000)
new_primModNatS00(vz50, vz51) → new_primModNatS(new_primMinusNatS3(vz50, vz51), Succ(vz51))
new_primModNatS0(vz50, vz51, Zero, Zero) → new_primModNatS00(vz50, vz51)
new_primModNatS0(vz50, vz51, Succ(vz520), Succ(vz530)) → new_primModNatS0(vz50, vz51, vz520, vz530)

The TRS R consists of the following rules:

new_primMinusNatS3(Zero, Succ(vz550)) → Zero
new_primMinusNatS3(Succ(vz560), Succ(vz550)) → new_primMinusNatS3(vz560, vz550)
new_primMinusNatS3(Zero, Zero) → Zero
new_primMinusNatS3(Succ(vz560), Zero) → Succ(vz560)

The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS2(x0, x1)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS3(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS2(x0, x1)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

                                ↳ QDP

                                  ↳ Rewriting

                                    ↳ QDP

                                      ↳ Rewriting

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

new_primModNatS0(vz50, vz51, Succ(vz520), Zero) → new_primModNatS(new_primMinusNatS3(vz50, vz51), Succ(vz51))
new_primModNatS(Succ(Succ(vz3000)), Succ(vz4000)) → new_primModNatS0(vz3000, vz4000, vz3000, vz4000)
new_primModNatS00(vz50, vz51) → new_primModNatS(new_primMinusNatS3(vz50, vz51), Succ(vz51))
new_primModNatS0(vz50, vz51, Succ(vz520), Succ(vz530)) → new_primModNatS0(vz50, vz51, vz520, vz530)
new_primModNatS0(vz50, vz51, Zero, Zero) → new_primModNatS00(vz50, vz51)

The TRS R consists of the following rules:

new_primMinusNatS3(Zero, Succ(vz550)) → Zero
new_primMinusNatS3(Succ(vz560), Succ(vz550)) → new_primMinusNatS3(vz560, vz550)
new_primMinusNatS3(Zero, Zero) → Zero
new_primMinusNatS3(Succ(vz560), Zero) → Succ(vz560)

The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS3(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_primModNatS(Succ(Succ(vz3000)), Succ(vz4000)) → new_primModNatS0(vz3000, vz4000, vz3000, vz4000)

The remaining pairs can at least be oriented weakly.

new_primModNatS0(vz50, vz51, Succ(vz520), Zero) → new_primModNatS(new_primMinusNatS3(vz50, vz51), Succ(vz51))
new_primModNatS00(vz50, vz51) → new_primModNatS(new_primMinusNatS3(vz50, vz51), Succ(vz51))
new_primModNatS0(vz50, vz51, Succ(vz520), Succ(vz530)) → new_primModNatS0(vz50, vz51, vz520, vz530)
new_primModNatS0(vz50, vz51, Zero, Zero) → new_primModNatS00(vz50, vz51)

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_primMinusNatS3(x₁, x₂)) = x₁
POL(new_primModNatS(x₁, x₂)) = x₁
POL(new_primModNatS0(x₁, x₂, x₃, x₄)) = x₁
POL(new_primModNatS00(x₁, x₂)) = x₁

The following usable rules [17] were oriented:

new_primMinusNatS3(Zero, Succ(vz550)) → Zero
new_primMinusNatS3(Zero, Zero) → Zero
new_primMinusNatS3(Succ(vz560), Succ(vz550)) → new_primMinusNatS3(vz560, vz550)
new_primMinusNatS3(Succ(vz560), Zero) → Succ(vz560)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

                                ↳ QDP

                                  ↳ Rewriting

                                    ↳ QDP

                                      ↳ Rewriting

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

new_primModNatS0(vz50, vz51, Succ(vz520), Zero) → new_primModNatS(new_primMinusNatS3(vz50, vz51), Succ(vz51))
new_primModNatS00(vz50, vz51) → new_primModNatS(new_primMinusNatS3(vz50, vz51), Succ(vz51))
new_primModNatS0(vz50, vz51, Zero, Zero) → new_primModNatS00(vz50, vz51)
new_primModNatS0(vz50, vz51, Succ(vz520), Succ(vz530)) → new_primModNatS0(vz50, vz51, vz520, vz530)

The TRS R consists of the following rules:

new_primMinusNatS3(Zero, Succ(vz550)) → Zero
new_primMinusNatS3(Succ(vz560), Succ(vz550)) → new_primMinusNatS3(vz560, vz550)
new_primMinusNatS3(Zero, Zero) → Zero
new_primMinusNatS3(Succ(vz560), Zero) → Succ(vz560)

The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS3(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 3 less nodes.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

                                ↳ QDP

                                  ↳ Rewriting

                                    ↳ QDP

                                      ↳ Rewriting

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

Q DP problem:
The TRS P consists of the following rules:

new_primModNatS0(vz50, vz51, Succ(vz520), Succ(vz530)) → new_primModNatS0(vz50, vz51, vz520, vz530)

The TRS R consists of the following rules:

new_primMinusNatS3(Zero, Succ(vz550)) → Zero
new_primMinusNatS3(Succ(vz560), Succ(vz550)) → new_primMinusNatS3(vz560, vz550)
new_primMinusNatS3(Zero, Zero) → Zero
new_primMinusNatS3(Succ(vz560), Zero) → Succ(vz560)

The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS3(Succ(x0), Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

                                ↳ QDP

                                  ↳ Rewriting

                                    ↳ QDP

                                      ↳ Rewriting

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                                                            ↳ QDP

                                                              ↳ QReductionProof

Q DP problem:
The TRS P consists of the following rules:

new_primModNatS0(vz50, vz51, Succ(vz520), Succ(vz530)) → new_primModNatS0(vz50, vz51, vz520, vz530)

R is empty.
The set Q consists of the following terms:

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS3(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS3(Zero, Zero)
new_primMinusNatS3(Succ(x0), Succ(x1))
new_primMinusNatS3(Zero, Succ(x0))
new_primMinusNatS3(Succ(x0), Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ AND

                        ↳ QDP

                        ↳ QDP

                          ↳ UsableRulesProof

                            ↳ QDP

                              ↳ QReductionProof

                                ↳ QDP

                                  ↳ Rewriting

                                    ↳ QDP

                                      ↳ Rewriting

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                                                            ↳ QDP

                                                              ↳ QReductionProof

                                                                ↳ QDP

                                                                  ↳ QDPSizeChangeProof

Q DP problem:
The TRS P consists of the following rules:

new_primModNatS0(vz50, vz51, Succ(vz520), Succ(vz530)) → new_primModNatS0(vz50, vz51, vz520, vz530)

From the DPs we obtained the following set of size-change graphs:

new_primModNatS0(vz50, vz51, Succ(vz520), Succ(vz530)) → new_primModNatS0(vz50, vz51, vz520, vz530)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 > 4

primModNatS0	x y True	= primModNatS (primMinusNatS x y) (Succ y)
primModNatS0	x y False	= Succ x

primModNatP0	x y True	= primModNatP (primMinusNatS x y) (Succ y)
primModNatP0	x y False	= primMinusNatS y x